package LeetCode.month03.day75;

import java.util.List;

/**
 * @author 16778
 * @date 2025/10/15 8:12
 * @description
 */
public class No3350 {
    public int maxIncreasingSubarrays(List<Integer> nums) {
        int n = nums.size();
        int res = 1;
        int num = 1;
        int pre = 1;
        for (int i = 1; i < n; i++) {
            if(nums.get(i)>nums.get(i-1)){
                num++;
            }else{
                res = Math.max(res,Math.max(Math.min(num,pre),num/2));
                pre = num;
                num = 1;
            }
        }
        res = Math.max(res,Math.max(Math.min(num,pre),num/2));
        return res;
    }
}
